short text classif twitter improv inform filter microblog servic twitter user overwhelm raw data solut problem classif short text messag short text provid suffici word occurr tradit classif method bag word limit address problem propos small set domain specif featur extract author profil text propos approach effect classifi text predefin set gener class mutual inform base extrins similar microarrai analysi secondari bitmap index vertic horizont partit bitmap dbase index structur microarraydesign onlin search tool repositori doptim microarrai experiment design distanc dbase index residu contact protein structur retriev align distanc dbase index residu contact protein structur retriev align autom data discoveri similar score queri abstract vast amount inform store scientif databas web dynam natur scientif data cost provid date snapshot databas proprietari consider compel databas owner hide origin data search interfac inform provid research similar search queri interfac limit proper focus analysi data studi present systemat method data discoveri similar score queri uncoop databas method gener multidimension data norm distanc function accuraci perform method demonstr synthet real life dataset method develop studi enabl scientist obtain data rang research interest overcom limit similar search interfac result studi present implic data privaci secur area discoveri origin data desir analysi basic data reorder techniqu abstract data reorder techniqu appli improv space time effici storag queri system scientif commerci applic run length encod promin approach compress area perform significantli enhanc achiev longer fewer run data reorder paper theoret studi reorder techniqu lexicograph order grai code order analyz method context bitmap index high queri perform account commonli bitmap encod equal rang analysi data tupl order method perform equal encod grai code achiev compress rang encod experiment result provid valid theoret analysi index high dimension paper address problem quickli perform point queri high dimension region queri increasingli import problem multimedia identif retriev databas entri metric similar databas literatur focus index high dimension nearest neighbor epsilon rang queri index point queri high dimension region address present effici index method queri reli combin redund bit vector index achiev signific perform gain implement approach real world audio fingerprint system obtain factor speed linear scan hilbert bulk load tree techniqu capabl search low dimension region shown ineffect audio fingerprint system inher high dimension properti problem enhanc partial order curv comparison algorithm applic analyz protein fold trajectori celltrack open dsourc softwar cell track motil analysi integr search align protein structur motiv identif comparison similar threedimension protein structur greater challeng face rapidli grow structur databas introduc vorometr method effici search align queri protein databas protein structur voronoi contact protein residu enrich secondari structur inform metric substitut matrix develop effici index contact hit obtain distanc base index method extend obtain highscor segment pair gener structur align result vorometr address search align problem protein structur databas experiment result show vorometr simultan effect retriev similar protein structur produc high qualiti structur align identifi cross fold similar vorometr outperform current structur retriev method search accuraci requir compar run time structur superposit produc shown qualiti coverag compar popular structur align tool avail vorometr web servic increment mainten onlin summari multipl stream onlin index recommend high ddimension databas queri workload problem parallel highdimension proxim join present parallel multidimension join algorithm base epsilon kdb tree compar common approach space partit evalu algorithm ibm sp share multiprocessor present synthet real life dataset examin effect algorithm context specif data mine problem find similar time seri empir result show algorithm exhibit good perform scalabl abil handl dataskew introduct emerg applic requir effici process proxim join high dimension point typic queri applic includ ffl find pair similar imag prelud cluster imag ffl retriev music score similar target music score ffl discov stock similar price movement onlin index recommend high ddimension databas queri workload problem parallel highdimension proxim join present parallel multidimension join algorithm base epsilon kdb tree compar common approach space partit evalu algorithm ibm sp share multiprocessor present synthet real life dataset examin effect algorithm context specif data mine problem find similar time seri empir result show algorithm exhibit good perform scalabl abil handl dataskew introduct emerg applic requir effici process proxim join high dimension point typic queri applic includ ffl find pair similar imag prelud cluster imag ffl retriev music score similar target music score ffl discov stock similar price movement multi dmetric similar base analysi microarrai data increment quantiz ag data stream updat consciou bitmap indic bitmap indic wide domain data wareh scientif applic due effici answer queri type larg data set util larg limit read data set static snapshot data due cost updat append data typic bitmap index attribut tabl attribut bin rang bitmap updat reflect append row tabl repres hundr thousand bitmap insert singl record prohibit costli order transfer fast queri respons time offer bitmap indic dynam databas domain propos updat consciou bitmap index mechan quickli updat bitmap reflect dynam databas insert oper bitmap repres valu insert updat formal insert delet oper propos techniqu provid cost model bitmap updat compar updat consciou bitmap tradit bitmap term storag space updat perform queri execut time gener framework model process optim queri lfm dpro tool detect signific local structur site protein data space map effici fo larg multi ddimension databas index incomplet databas index incomplet databas vision cyberinfrastructur coastal forecast chang analysi approxim encod direct access queri process compress bitmap bitmap indic wide successfulli scientif commerci databas compress techniqu base run length encod improv storag perform techniqu introduc signific overhead queri process row queri propos bitmap encod scheme base multipl hash bitmap compress form directli access decompress subset row column retriev effici reconstruct process subset bitmap propos scheme approxim result trade amount space accuraci fals miss guarante occur fals posit rate estim control show queri execut significantli faster wah compress bitmap previous shown achiev fastest queri respons time propos scheme achiev accur result improv speed queri process order magnitud compar wah effici parallel process rang queri replic declust common techniqu minim data intens applic data declust parallel server techniqu involv distribut data disk parallel queri retriev improv perform focu optim access larg spatial data common type queri data rang queri optim declust scheme process rang queri balanc uniformli disk shown singl copi base declust scheme optim rang queri paper integr replic conjunct parallel disk declust effici process rang queri note replic larg databas applic purpos load balanc fault toler avail data propos theoret foundat replic declust propos class replic declust scheme period alloc shown strictli optim number disk propos framework replic declust limit amount replic provid extens appli real data includ arbitrari grid larg number disk framework effect index scheme enabl fast identif data interest parallel server addit optim process singl queri show framework effect parallel process multipl queri present experiment result compar propos replic scheme techniqu singl queri multipl queri synthet real data set access structur angular similar queri inform mine heterogen high ddimension time dseri data clinic trial databas high dimension nearest neighbor search search nearest neighbor larg number vector high dimension space costli time consum support high dimension nearest neighbor search low dimension approxim vector filter vector reduc search space exist studi singl level approxim paper propos multilevel approxim scheme data vector approxim level lower bound upper bound deriv distanc queri vector distanc bound deriv finer approxim level tighter cost deriv higher paper present multilevel filter method approxim scheme coarsest level approxim low volum dimension index tree comput set candid vector finer level approxim ar onlin summar dynam time seri data compress bitmap indic data reorgan scientif applic gener massiv volum data observ comput simul bring effect index method effici storag retriev scientif data unlik convent databas scientif data read volum reach order petabyt make compact index structur vital bitmap index successfulli appli scientif databas exploit fact scientif data enumer numer bitmap indic compress variant run length encod compact index structur enorm data gener applic high energi physic paper studi reorgan bitmap tabl improv compress rate algorithm preprocess step revis current index techniqu queri process algorithm introduc tupl reorder problem aim reorgan databas tupl optim compress rate propos grai code order algorithm np complet problem inplac algorithm run linear time order size databas discuss tupl reorder problem reduc travel salesperson problem experiment result real data set show compress ratio optim data dspace partit spatial data parallel fo desir design partit method minim time incur queri execut spatial databas paper explor optim partit dimension data class queri develop multi disk alloc techniqu maxim degre parallel obtain case show hexagon partit optim perform circular queri partit method convex overlap region analysi extens result partit techniqu rectangular queri show hexagon partit perform gener class rang queri rectilinear queri case rectangular grid partit superior current algorithm rectangular grid partit parallel storag retriev algorithm hexagon partit construct result carri circular partit data convex region vector space index biosequ similar search time seri analysi microarrai data replic declust spatial data problem disk declust distribut data multipl disk reduc queri respons time parallel strictli optim declust techniqu achiev optim parallel queri paper focu techniqu optim spatial rang queri current declust techniqu singl copi data shown suboptim rang queri lower bound extra disk access prove disk restrict case grid current approach achiev bound replic effect solut problem databas avail load balanc paper explor idea replic context declust propos framework strictli optim parallel achiev small amount replic provid theoret foundat replic declust bound number copi strict optim number disk propos class replic declust scheme period alloc shown strictli optim result optim disk alloc extend larger number disk increas replic techniqu result valid arbitrari grid declust scheme improv replic framework framework perform experi identifi strictli optim disk access schedul arbitrari rang queri addit theoret bound compar propos replic base scheme exist techniqu perform experi real dataset dimension reduct similar comput dproduct approxim develop dynam dimension reduct base approxim standard product innerproduct distanc measur wide area applic document databas latent semant index lsi order approxim product obtain cauchi schwarz inequ method propos paper refin approxim higher order power symmetr function compon vector power norm vector show comput fix coeffici work univers weight base moment probabl densiti function assum distribut compon input vector data set experi synthet document data show techniqu similar object high dimension space applic accur approxim signi effect index filter similar search larg biosequ databas present multi dimension index approach fast sequenc similar search dna protein databas propos effect transform subsequ numer vector domain build effici index structur transform vector defin distanc function transform domain examin properti function experiment compar approxim qualiti nearest neighbor nn queri prune abil approxim qualiti rang queri result nn queri present show propos distanc fd wd frequenc wavelet distanc function gram perform significantli develop effect index structur base tree scalar quantiz top transform vector distanc function promis result experi real biosequ data set present high dimension revers nearest neighbor queri revers nearest neighbor rnn queri interest wide rang applic decis support system profil base market data stream document databas bioinformat earlier approach solv problem deal dimension data applic inher involv high dimens high dimension rnn problem unexplor paper propos approxim solut answer rnn queri high dimens approach nn rnn work phase phase nn queri point found phase analyz type queri boolean rang queri brq experiment result show brq cient nn rang queri ectiv answer rnn queri perform improv run multipl brq simultan propos approach answer variant rnn queri rnn order bichromat rnn match queri applic techniqu cientli answer nn rnn variant approxim number run nn queri dimension reduct magnitud shape approxim high dimension data set encount modern databas applic usual approach construct summari data set lossi compress techniqu lower dimension synopsi provid fast approxim answer queri paper develop dimension reduct techniqu base partit high dimension vector space orthogon subspac find relat euclidian distanc dimension vector euclidian distanc project orthogon subspac base relat develop method approxim euclidian distanc product approxim process incorpor shape inform vector approxim product approxim symmetr captur magnitud inform data propos method take magnitud shape inform origin vector account partit experi demonstr effect techniqu compar commonli method comri compress multi dresolut index structur sequenc similar queri paper present comri compress multiresolut index system fast sequenc similar search dna sequenc databas emploi virtual bound rectangl vbr concept build compress grid style index structur advantag grid format tree subsequ locat inform order vbr vbr list take advantag vbr index structur fit reason size memori easili optim multiresolut search algorithm queri speed improv significantli extens perform evalu human chromosom sequenc data show vbr save index storag size compar mbr minimum ound rectangl search algorithm prune unnecessari vbr guarante effici disk cpu cost result experi perform comri time faster mr grid index structur introduc recent peer dto dpeer spatial queri sensor network sensor network consist potenti thousand node sens heat sound light magnet wireless commun capabl provid great opportun monitor spatial inform region interest spatial queri execut studi extens context databas system index technolog solut directli applic context sensor network due decentr natur sensor network limit comput power energi scarciti individu sensor node paper effici dnn search stream data seri data stream common recent applic stock quot commerc data vq dindex index structur similar search multimedia databas paper introduc index techniqu base effici compress featur space approxim similar search larg multimedia databas main novelti state art tool disciplin data compress adopt optim complex perform tradeoff larg data set design procedur optim queri access time jointli account databas distribut queri statist achiev effici compress vector quantiz vq techniqu multi stage vq split vq suit limit memori applic partit data set accumul queri histori partit data point separ compress vector quantiz tailor distribut emploi vq techniqu inher provid spectrum point choos time accuraci plane properti crucial larg multimedia databas time bottleneck offer flexibl trade time accuraci experi demonstr speedup va file techniqu adapt approxim nearest neighbor search vulner similar search base system similar base queri common modern databas applic multimedia scientif biomed databas system databas respond tupl closest match metric paper investig import secur issu relat similar search databas investig vulner system user copi databas send autom queri analyz model similar search repli model score model repli model respond tupl match score model respond score similar search model analyz wai attack strategi detect attack analysi show score model easier plug vulner repli model sophist attack easili repli model databas limit capabl prevent attack optim parallel fo replic lot interest declust spatial data effici parallel declust distribut block data multipl devic enabl parallel access reduc queri respons time strictli optim declust disk alloc techniqu achiev optim perform queri prove imposs reach strict optim parallel gener scenario lower bound extra disk access prove disk restrict case grid current approach achiev bound paper propos replic reach optim parallel multi disk processor architectur replic effect solut problem databas context avail load balanc problem explor idea replic context declust propos optim declust techniqu intellig replic investig strictli optim parallel achiev small amount replic focu alloc base latin squar deriv nice properti replic declust purpos replic strategi propos evalu propos scheme strict optim reach singl replic rang queri number disk show grid disk gener arbitrari grid show effici find optim disk access arbitrari queri store minim inform effici process conic queri conic queri type queri increas number applic tradit index structur retriev mechan gener optim rectangular circular queri conic queri paper focu conic queri defin multi dimension cone multi dimension data space develop model express queri suggest effici techniqu evalu explor retriev problem context conic queri process develop multi disk alloc method specif process conic queri optim partit effici fo spatial databas desir design partit techniqu minim time incur queri execut spatial databas paper explor optim partit techniqu spatial data type queri develop multi disk alloc techniqu maxim degre parallel obtain retriev show hexagon partit optim cost circular queri compar overlap partit techniqu convex region rectangular queri show special case queri rectilinear rectangular grid partit superior perform hexagon partit cost gener class rang queri discuss parallel storag retriev techniqu hexagon partit current techniqu rectangular grid partit approxim nearest neighbor search multimedia databas paper develop gener framework approxim nearest neighbor queri categor current approach nearest neighbor queri process base abil reduc data set examin abil reduc represent size data object propos modif wellknown techniqu support progress process approxim nearest neighbor queri user stop retriev process inform return develop techniqu base cluster merg benefit gener class approach cluster base approach user progress explor approxim result increas accuraci propos metric evalu approxim nearest neighbor search techniqu propos tradit metric analyz compar techniqu detail perform evalu demonstr feasibl effici approxim nearest neighbor search perform experi real data set establish superior propos cluster base techniqu exist techniqu approxim nearest neighbor search constrain nearest neighbor queri vector approxim base index duniform high dimension data set prolifer multimedia data increas support index search high dimension data recent vector approxim base techniqu call va file propos index high dimension data shown va file effect techniqu compar current approach base space data partit va file good perform data set uniformli distribut real data set uniformli distribut cluster dimens featur vector real data set correl care analysi nonuniform correl data need effect index high dimension data propos solut problem propos va file techniqu index high dimension data set base vector approxim conclud evalu nearest neighbor queri show va file techniqu re dimension reduct similar comput product approxim develop dynam dimension reduct base approxim standard product innerproduct distanc measur wide area applic document databas latent semant index lsi order approxim product obtain cauchi schwarz inequ method propos paper refin approxim higher order power symmetr function compon vector power norm vector show comput fix coeffici work univers weight base moment probabl densiti function assum distribut compon input vector data set experi synthet document data show techniqu similar object high dimension space applic accur approxim signi cluster declust data effici retriev modern databas increasingli integr kind inform multimedia inform form imag video audio data dimension amount data process increas rapidli increas demand ecient retriev larg amount multi dimension data declust techniqu multi disk architectur effect storag paper establish exploit parallel care organ disk consid fast search introduc notion page alloc data space map organ retriev multidimension data develop notion base di erent partit strategi regular grid partit concentr hypercub hyperpyramid develop techniqu satisfi effici retriev optim number bucket retriev queri disk arm movement parallel concentr hyperspac disk alloc fast parallel rang search data partit declust extens past parallel rang queri numer declust disk alloc techniqu propos literatur techniqu primarili design dimension data balanc partit data space databas increasingli integr multimedia inform form imag video audio data extend declust techniqu multidimension data paper establish tradit declust techniqu scale high dimension data propos partit scheme base concentr hyperspac develop disk alloc method propos scheme conclud evalu rang queri base scheme show partit base concentr hyperspac signific advantag balanc partit approach parallel 